dynamic programming algorithm造句
例句與造句
- Solves the most short - path using the dynamic programming algorithm
利用動(dòng)態(tài)規(guī)劃算法求解最短路徑 - Dynamic programming algorithm of bottleneck transportation problem based on entropy
基于熵的瓶頸運(yùn)輸問(wèn)題的動(dòng)態(tài)規(guī)劃解 - Dynamic programming algorithm of m - dimensional bottleneck assignment problem based on entropy
維瓶頸指派問(wèn)題的動(dòng)態(tài)規(guī)劃解 - In this paper , a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented
摘要本文給出了一種求解無(wú)限制板材下料問(wèn)題的動(dòng)態(tài)規(guī)劃解法，對(duì)該算法的計(jì)算復(fù)雜度進(jìn)行了分析。 - This paper is to establish a system based on electronic map for motorcade - optimized dispatching , and dynamic programming algorithm is used to realize vehicle dispatching
本文的中心內(nèi)容是：組建了一個(gè)基于電子地圖大型車隊(duì)優(yōu)化調(diào)度及管理系統(tǒng)，并用動(dòng)態(tài)規(guī)劃算法實(shí)現(xiàn)了車輛的智能調(diào)度。 - It's difficult to find dynamic programming algorithm in a sentence. 用dynamic programming algorithm造句挺難的
- 4 . design the optimal loiter trajectory of the attack uav in the horizontal plane using maximum principle and desige the loiter strategy of the attack uav using dynamic programming algorithm and game theory . 5
運(yùn)用最大值原理對(duì)待機(jī)搜索段進(jìn)行優(yōu)化設(shè)計(jì)，并且應(yīng)用博弈論、動(dòng)態(tài)規(guī)劃方法對(duì)搜索策略進(jìn)行設(shè)計(jì)，提高了無(wú)人機(jī)使用效率和作戰(zhàn)效能。 - Abstract to increase the storage capacity of mobile equipment and improve the transmission efficiency of vector data on network , this paper proposed a model and improved method of vector data compression based on dynamic programming algorithm
摘要為了使移動(dòng)設(shè)備存儲(chǔ)大容量的矢量數(shù)據(jù)和提高矢量數(shù)據(jù)的網(wǎng)絡(luò)傳輸效率，矢量數(shù)據(jù)壓縮是一項(xiàng)很重要的工作。 - In the algorithm , a search tree with roots of the cumulative demands in the corresponding period is taken as the roots of the search tree , transforming the quantity discount problem into dynamic order quantity ( doq ) problem that is solvable with a dynamic programming algorithm
該算法以各時(shí)段的累計(jì)需求為根節(jié)點(diǎn)建立搜索樹(shù)，從而將帶折扣的庫(kù)存問(wèn)題轉(zhuǎn)化為典型的動(dòng)態(tài)批量問(wèn)題，運(yùn)用動(dòng)態(tài)規(guī)劃法即可求解。 - Basing on studying the principle of active contour model and some solutions to it , a new partial optimal dynamic programming contour detection algorithm is presented and the results comparable to the dynamic programming algorithm are given
在研究動(dòng)態(tài)輪廓模型原理及其求解算法的基礎(chǔ)上提出了一種新的部分最優(yōu)化動(dòng)態(tài)規(guī)劃輪廓檢測(cè)算法，保留了動(dòng)態(tài)規(guī)劃算法的性能和優(yōu)點(diǎn)，但綜合運(yùn)算復(fù)雜度降低，運(yùn)算速度大大提高。 - As more and more genome sequencing projects are accomplished one after another , the amount of sequence data has been exponentially increased , the demand for efficient alignment algorithm in sequence analysis is increasingly urgent . based on the concept of sequence segmentation , we applied the multiple - stage dynamic programming algorithm in pairwise alignment to devise a new algorithm named samidp and developed the corresponding programs in visualbasic , we find that samidp not only reduces the computation complexity to o ( n ) , but also obtains even satisfactory accuracy , and it is expected that the new algorithm will be important in global sequence alignment
基于段與段比對(duì)的概念，我們?cè)O(shè)計(jì)了一個(gè)用于核酸序列全局比對(duì)的新算法samidp ( sequencealignmentbasedonmultiplestageintelligentdynamicprogrammingalgorithm ) ，將多階段動(dòng)態(tài)規(guī)劃決策算法用于兩兩序列比對(duì)并用visualbasic編程實(shí)現(xiàn)，結(jié)果發(fā)現(xiàn)該新算法在將計(jì)算復(fù)雜度減小到o ( n )的同時(shí)，也能夠獲得較為理想的計(jì)算精度，預(yù)期將在序列全局比對(duì)中起重要作用。 - So a lot of researchers have attached importance to optimization computing , and put forward all kinds of algotithms for optimization problems , for instance : simplex algorithm , dynamic programming algorithm , branch - bound algorithm , etc . but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems
為了解決各種優(yōu)化計(jì)算問(wèn)題，人們提出了各種各樣的優(yōu)化計(jì)算方法，如單純形法、梯度法、動(dòng)態(tài)規(guī)劃法、分枝剪界法。這些優(yōu)化算法各有各的長(zhǎng)處，各有各的適用范圍，也有各自的限制。 - In addition , we summarize some spatial join algorithms based on r - tree index and their cost estimation models . we also give out a query optimization algorithm framework based on dynamic programming algorithm , and integrated basic r - tree index method and query optimization mechanism into sadbs ii
另外，本文還總結(jié)了幾種基于r樹(shù)索引的空間連接算法及其代價(jià)評(píng)估模型，利用動(dòng)態(tài)編程算法給出了查詢優(yōu)化的算法框架，并在sadbs中集成了基本的r樹(shù)索引方法和查詢優(yōu)化機(jī)制。